The basis of 2× 2 monotone grid classes
نویسندگان
چکیده
In this note, we prove that all 2× 2 monotone grid classes are finitely based, i.e., defined by a finite collection of minimal forbidden permutations. This follows from a slightly more general result about certain 2× 2 having two monotone cells in the same row.
منابع مشابه
2×2 Monotone Grid Classes Are Finitely Based
In recent years, the emerging theory of grid classes has led to some of the major structural and enumerative developments in the study of permutation patterns. Particular highlights include the characterisation of all possible “small” growth rates (Huczynska and Vatter, 2006; Kaiser and Klazar, 2003; Vatter, 2011) and the subsequent result that all classes with these growth rates have rational ...
متن کاملThe Open University ’ s repository of research publications and other research outputs 2 monotone grid classes are finitely based
The Open University's repository of research publications and other research outputs 2 monotone grid classes are finitely based Journal Article Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. In this not...
متن کاملThe Open University ’ s repository of research publications and other research outputs 2 monotone grid classes are finitely
The Open University's repository of research publications and other research outputs 2 monotone grid classes are finitely based Journal Article Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. In this not...
متن کاملJuxtaposing Catalan Permutation Classes with Monotone Ones
This talk describes a clean and unified way to enumerate all juxtaposition classes of the form “Av(abc) next to Av(xy)”, where abc is a permutation of length three and xy is a permutation of length two. The main tools are Dyck paths, decorated by sequences of points, and context free grammars, used afterwards to enumerate these decorated Dyck paths. Juxtapositions are a simple special case of p...
متن کاملOn Partial Well-Order for Monotone Grid Classes of Permutations
The permutation π of [n] = {1, 2, . . . , n} contains the permutation σ of [k] = {1, 2, . . . , k} (written σ ≤ π) if π has a subsequence of length k order isomorphic to σ. For example, π = 391867452 (written in list, or one-line notation) contains σ = 51342, as can be seen by considering the subsequence 91672 (= π(2), π(3), π(5), π(6), π(9)). A permutation class is a downset of permutations un...
متن کامل